翻訳と辞書 Words near each other ・ Open-mid back unrounded vowel ・ Open-mid central rounded vowel ・ Open-mid central unrounded vowel ・ Open-mid front rounded vowel ・ Open-mid front unrounded vowel ・ Open-mid vowel ・ Open-mindedness ・ Open-News-Network e.V. ・ Open-pan salt making ・ Open-pit coal mining in the United Kingdom ・ Open-pit mining ・ Open-pool Australian lightwater reactor ・ Open-question argument ・ Open-Realty ・ Open-Sankoré ・ Open-shop scheduling ・ Open-Silicon ・ Open-source advocacy ・ Open-source architecture ・ Open-source bounty ・ Open-source brand ・ Open-source car ・ Open-source cola ・ Open-source computing hardware ・ Open-source curriculum ・ Open-source economics ・ Open-source film ・ Open-source governance ・ Open-source hardware ・ Open-source intelligence Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Open-shop scheduling ： ウィキペディア英語版 Open-shop scheduling In theoretical computer science and operations research, the open-shop scheduling problem (OSSP) is a scheduling problem in which a given set of jobs must each be processed for given amounts of time at each of a given set of workstations, in an arbitrary order, and the goal is to determine the time at which each job is to be processed at each workstation. The problem was first studied by Teofilo F. Gonzalez and Sartaj Sahni in 1976.〔.〕 ==Definition== More precisely, the input to the open-shop scheduling problem consists of a set of ''n'' jobs, another set of ''m'' workstations, and a two-dimensional table of the amount of time each job should spend at each workstation (possibly zero). Each job may be processed only at one workstation at a time, and each workstation can process only one job at a time. However, unlike the job-shop problem, the order in which the processing steps happen can vary freely. The goal is to assign a time for each job to be processed by each workstation, so that no two jobs are assigned to the same workstation at the same time, no job is assigned to two workstations at the same time, and every job is assigned to each workstation for the desired amount of time. The usual measure of quality of a solution is its makespan, the amount of time from the start of the schedule (the first assignment of a job to a workstation) to its end (the finishing time of the last job at the last workstation). 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Open-shop scheduling」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.